Partial Observability and Probabilistic Plan/Goal Recognition
نویسندگان
چکیده
Partial observability of the domain prevents the application of many plan recognition algorithms to real world problems. This paper presents a treatment for partial observability for a specific probabilistic plan recognition algorithm and an initial analysis of the runtime impact.
منابع مشابه
Probabilistic Plan Recognition for Hostile Agents
This paper presents a probabilistic and abductive theory of plan recognition that handles agents that are actively hostile to the inference of their plans. This focus violates a primary assumption of most previous work, namely complete observability of the executed actions.
متن کاملPlan Validation for Extended Goals under Partial Observability (preliminary report)
The increasing interest in planning in nondeterministic domains by model checking has seen the recent development of two complementary research lines. In the first, planning is carried out considering extended goals, expressed in the CTL temporal logic, but has been developed under the simplifying hypothesis of full observability. In the second, simple reachability goals have been tackled under...
متن کاملProbapop: Probabilistic Partial-Order Planning
We describe Probapop, a partial-order probabilistic planning system. Probapop is a blind (conformant) planner that finds plans for domains involving probabilistic actions but no observability. The Probapop implementation is based on Vhpop, a partial-order deterministic planner written in C++. The Probapop algorithm uses plan graph based heuristics for selecting a plan from the search queue, and...
متن کاملValidation for Extended Goals under Partial Observability
The increasing interest in planning in nondeterministic domains by model checking has seen the recent development of two complementary research lines. In the first, planning is carried out considering extended goals, expressed in the CTL temporal logic, but has been developed under the simplifying hypothesis of full observability. In the second, simple reachability goals have been tackled under...
متن کاملComplexity of Conditional Planning under Partial Observability and Infinite Executions
The computational properties of many classes of conditional and contingent planning are well known. The main division in the field is between probabilistic planning (typically infinite or unbounded executions, reward rather than goal-based, and focus on expected costs or rewards) and non-probabilistic planning (ignoring probabilities, focus on plans that reach goal states.) In this work, we add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005